A Simplex Nelder Mead Genetic Algorithm for Minimizing Molecular Potential Energy Function
نویسندگان
چکیده
1 A Simplex Nelder Mead Genetic Algorithm for Minimizing Molecular Potential Energy Function . . . . . . . . . . . . . . . . . . . . . . 1 Ahmed Fouad Ali and Aboul-Ella Hassanien 1.
منابع مشابه
A HYBRID MODIFIED GENETIC-NELDER MEAD SIMPLEX ALGORITHM FOR LARGE-SCALE TRUSS OPTIMIZATION
In this paper a hybrid algorithm based on exploration power of the Genetic algorithms and exploitation capability of Nelder Mead simplex is presented for global optimization of multi-variable functions. Some modifications are imposed on genetic algorithm to improve its capability and efficiency while being hybridized with Simplex method. Benchmark test examples of structural optimization with a...
متن کاملMinimizing multimodal functions by simplex coding genetic algorithm
Combining meta-heuristics with local search methods is one approach that recently has drawn much attention to design more efficient methods for solving continuous global optimization problems. In this paper, a new algorithm called Simplex Coding Genetic Algorithm (SCGA) is proposed by hybridizing genetic algorithm and simplexbased local search method called Nelder-Mead method. In the SCGA, each...
متن کاملCamera Calibration Using Compound Genetic-simplex Algorithm
The paper presents a novel camera calibration method using a two-step approach. First, a genetic algorithm is used to find a good enough approximation of the solution. Then a multidimensional unconstrained nonlinear minimization (Nelder-Mead simplex) algorithm is used to refine the solution. This approach avoids errors due to linearizations and automatically finds a very good initial point for ...
متن کاملImplementing the Nelder-Mead simplex algorithm with adaptive parameters
In this paper, we first prove that the expansion and contraction steps of the Nelder-Mead simplex algorithm possess a descent property when the objective function is uniformly convex. This property provides some new insights on why the standard Nelder-Mead algorithm becomes inefficient in high dimensions. We then propose an implementation of the Nelder-Mead method in which the expansion, contra...
متن کاملConvergence of the Restricted Nelder-Mead Algorithm in Two Dimensions
The Nelder–Mead algorithm, a longstanding direct search method for unconstrained optimization published in 1965, is designed to minimize a scalar-valued function f of n real variables using only function values, without any derivative information. Each Nelder–Mead iteration is associated with a nondegenerate simplex defined by n+ 1 vertices and their function values; a typical iteration produce...
متن کامل